RULES FOR RESTORING THE DROWNED DRAWN UP

Logic Programs with Consistency-Restoring Rules

We present an extension of language A-Prolog by consistency-restoring rules with preferences, give the semantics of the new language, CR-Prolog, and show how the language can be used to formalize various types of commonsense knowledge and reasoning. Introduction In recent years, A-Prolog – a language of logic programs with the answer set semantics (Gelfond & Lifschitz 1991) – was shown to be a ...

SPARC - Sorted ASP with Consistency Restoring Rules

This is a preliminary report on the work aimed at making CR-Prolog – a version of ASP with consistency restoring rules – more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The r...

[Histology of skin changes in the drowned].

Language ASP{f} with Arithmetic Expressions and Consistency-Restoring Rules

In this paper we continue the work on our extension of Answer Set Programming by non-Herbrand functions and add to the language support for arithmetic expressions and various inequality relations over non-Herbrand functions, as well as consistency-restoring rules from CR-Prolog. We demonstrate the use of this latest version of the language in the representation of important kinds of knowledge.

Negotiation Using Logic Programming with Consistency Restoring Rules

We formalize negotiations using logic programming with consistency restoring rules (or CRProlog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion...